home *** CD-ROM | disk | FTP | other *** search
/ Tech Arsenal 1 / Tech Arsenal (Arsenal Computer).ISO / tek-01 / wtek0693.zip / OOPALLEY.ZIP / XQUEUE.CPP < prev    next >
C/C++ Source or Header  |  1993-04-27  |  3KB  |  108 lines
  1. //#include <stream.h>
  2. #define DISPLAY_ARRAYOB_INFO
  3. #ifdef DISPLAY_ARRAYOB_INFO
  4. #include "arrayob.h"
  5. #endif
  6.  
  7.  
  8. #include "queue.h"
  9.  
  10.  
  11. #if 1
  12. // required only by test application
  13. #include "point.h"
  14. #include "conio.h"
  15. #endif
  16.  
  17.  
  18. void printRemove(Queue& q)
  19. {
  20.     cout << "Remove and print each object in Queue:\n";
  21.     while(q.size()>0)
  22.     {
  23.         cout << *q.next();
  24.         cout << " | ";
  25.     }
  26.     cout << "=======\n";
  27. }
  28.  
  29. #pragma argsused
  30. // q is used with preprocessor sizeof operator
  31. // but BC++ 3.1 reports that q is not used
  32. // The above pragma turns off the warning.
  33. void printObjectSizes(Queue& q)
  34. {
  35.     cout << "sizeof(q):" << sizeof(q) << "\n";
  36.     cout << "sizeof(Object):" << sizeof(Object) << "\n";
  37.     cout << "sizeof(Point):" << sizeof(Point) << "\n";
  38.     cout << "sizeof(Queue):" << sizeof(Queue) << "\n";
  39. #ifdef DISPLAY_ARRAYOB_INFO
  40.     cout << "sizeof(ArrayOb):" << sizeof(ArrayOb) << "\n";
  41. #endif
  42. }
  43.  
  44. #define BATCH
  45. #ifdef BATCH
  46. // useful for batch output verification
  47. inline int getch()  // don't wait for keypress
  48. {
  49.     cout << "========================================\n";
  50.     return 0;
  51. } 
  52. #endif
  53. main()
  54. {
  55.     cout << "hello, world\n";
  56.     Queue q(10);
  57.     cout <<  "q created\n";
  58.     cout <<  "q capacity: " << q.capacity() << "\n";
  59.     cout <<  "q size: " << q.size() << "\n";
  60.     printObjectSizes(q);
  61.     getch();
  62.  
  63. for (int i=0; i<2; i++)
  64. {
  65.     q.nextPut(*new Point(i,1));
  66.     q.nextPut(*new Point(i,2));
  67.     q.nextPut(*new Point(i,3));
  68.  
  69.     q.state();    printRemove(q);    getch();
  70.  
  71.     q.nextPut(*new Point(i,4));
  72.     q.nextPut(*new Point(i,5));
  73.     q.nextPut(*new Point(i,6));
  74.     q.nextPut(*new Point(i,7));
  75.     q.nextPut(*new Point(i,8));
  76.     q.nextPut(*new Point(i,9));
  77.     q.nextPut(*new Point(i,10));
  78.  
  79.     cout << "q should be filled:\n";
  80.  
  81.     q.state();    printRemove(q);    getch();
  82. }
  83.     i = 3;
  84.     q.nextPut(*new Point(i,1));
  85.     q.nextPut(*new Point(i,2));
  86.     q.nextPut(*new Point(i,3));
  87.  
  88.     q.state();      q.printOn(cout);       getch();
  89.  
  90.     q.nextPut(*new Point(i,4));
  91.     q.nextPut(*new Point(i,5));
  92.     q.nextPut(*new Point(i,6));
  93.     q.nextPut(*new Point(i,7));
  94.     q.nextPut(*new Point(i,8));
  95.     q.nextPut(*new Point(i,9));
  96.     q.nextPut(*new Point(i,10));
  97.  
  98.     q.state();    q.printOn(cout);
  99.     cout << "Next statement should resize q\n";
  100.     getch();
  101.  
  102.     q.nextPut(*new Point(i,11));
  103.     q.state();  getch();  printRemove(q);   getch();
  104.  
  105.     return 0;
  106. }
  107.  
  108.